On the Complexity of the Production-Transportation Problem
نویسندگان
چکیده
The production-transportation problem (PTP) is a generalization of the transportation problem. In PTP, we decide not only the level of shipment from each source to each sink but also the level of supply at each source. A concave production cost function is associated with the assignment of supplies to sources. Thus the objective function of PTP is the sum of the linear transportation costs and the production costs. We show that this problem is generally NP-hard and present some polynomial classes. In particular, we propose a polynomial algorithm for the case in which the transportation cost matrix has the Monge property and the number of sources is fixed. for the problem with two sources. 0. Introduction. It is known that the minimization problem over a polyhedron is polynomial when the objective function is convex [GLS88]. In contrast, many concave minimization problems are NP-hard. We consider here a concave minimization problem over transportation constraints called the production-transportation problem (PTP). PTP is a generalization of the transportation problem. In PTP we need to decide not only the level of shipment from each source to each sink but also the level of supply at each source. A concave production cost function is associated with the assignment of supplies to sources. The objective function is the sum of the linear transportation costs and the concave production costs.
منابع مشابه
Meta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
متن کاملBi-objective Optimization for Just in Time Scheduling: Application to the Two-Stage Assembly Flow Shop Problem
This paper considers a two-stage assembly flow shop problem (TAFSP) where m machines are in the first stage and an assembly machine is in the second stage. The objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. JIT seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...
متن کاملIntegrated capacitated transportation and production scheduling problem in a fuzzy environment
Nowadays, several methods in production management mainly focus on the different partners of supply chain management. In real world, the capacity of planes is limited. In addition, the recent decade has seen the rapid development of controlling the uncertainty in the production scheduling configurations along with proposing novel solution approaches. This paper proposes a new mathematical model...
متن کاملDesigning a green location routing inventory problem considering transportation risks and time window: a case study
This study introduces a green location, routing and inventory problem with customer satisfaction, backup distribution centers and risk of routes in the form of a non-linear mixed integer programming model. In this regard, time window is considered to increase the customer satisfaction of the model and transportation risks is taken into account for the reliability of the system. In addition, dif...
متن کاملMathematical Modeling for a Flexible Manufacturing Scheduling Problem in an Intelligent Transportation System
This paper presents a new mathematical model for a production system through a scheduling problem considering a material handling system as an intelligent transportation system by automated guided vehicles (AGVs). The traditional systems cannot respond to the changes and customer’s demands and for this reason, a flexible production system is used. Therefore, for this purpose, automated transpor...
متن کاملA Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM Journal on Optimization
دوره 6 شماره
صفحات -
تاریخ انتشار 1996